Design for Testability of an Asynchronous Adder
نویسندگان
چکیده
Modern technological processes for producing VLSI circuits have created an opportunity to exploit the advantages of asynchronous circuits. Compared to their synchronous counterparts, asynchronous circuits have the potential for lower power consumption, offer greater design flexibility, exhibit average rather than worst-case performance and have no problem with clock skew [Lav93, Hauck95]. Asynchronous circuits can be divided into three major groups depending on the delay model assumption chosen: delay-insensitive, speed-independent and bounded-delay circuits [Lav93, Birt95, Brzo95]. In delay-insensitive circuits, gate and wire delays are unconstrained but finite. Speed-independent circuits also operate correctly regardless of their gate delays, but signal transmissions along their wires are assumed to be instantaneous. All delays within bounded-delay asynchronous circuits are constrained. Data in asynchronous circuits can be represented using either dual-rail or single-rail data encoding techniques. In the dual-rail data representation each bit of data is encoded using two wires. In four-phase dual-rail encoding, a high logic level on the ‘one’ or ‘zero’ wire and a low logic level on the corresponding ‘zero’ or ‘one’ wire indicates the transmission of a one or a zero respectively. If both data wires are set to zero data is not valid. The state ‘11’ is illegal. In the single-rail encoding a bit of data is represented by the logic level on one wire.
منابع مشابه
Design for Testability Implementation Of Dual Rail Half Adder Based on Level Sensitive Scan Cell Design
Design for testability (DFT) refers to hardware design styles or it is an added hardware that reduces test generation complexity and test cost, also increases test quality. Sleep Convention Logic (SCL) is an asynchronous logic style which is based on Null Convention Logic (NCL). In the SCL the combinational blocks are made of threshold gates. SCL utilizes power gating method to further reduce t...
متن کاملTestabiiity of Convergent Tree Circuits - Computers, IEEE Transactions on
The testing properties of a class of regular circuits called convergent trees are investigated. Convergent trees include such practical circuits as comparators, multiplexers, and carry-lookahead adders. The conditions for the testability of these tree circuits are derived for a functional fault model. The notion of L-testability is introduced, where the number of tests for a plevel tree is dire...
متن کاملComparison of an Asynchronous Manchester Carry Chain Adder to a Synchronous Manchester Carry Chain Adder
We compare two 16 bit adders based on the Manchester Carry Chain (MCC) circuit topology using the TSMC .25 µm process technology. The first circuit is a synchronous 16 bit adder based on an optimized 4-bit MCC where the carry out of each of the 4-bit MCCs are ripple carried into the next MCC block through an edge sensitive D-Flip Flop. The second circuit is an asynchronous adder, which uses the...
متن کاملArea-Efficient Design of Asynchronous Circuits Based on Balsa Framework for Synchronous FPGAs
This paper presents an efficient asynchronous design methodology for synchronous FPGAs. The mixed synchronous/asynchronous design is the best way to minimize the power consumption of a circuit implemented on a synchronous FPGA. For asynchronous circuit synthesis, Balsa was proposed. However, the problem is that circuits synthesized from Balsa description need a lot of logic resources. To solve ...
متن کاملAn Asynchronous Early Output Full Adder and a Relative-Timed Ripple Carry Adder
This article presents the design of a new asynchronous early output full adder which when cascaded leads to a relative-timed ripple carry adder (RCA). The relative-timed RCA requires imposing a very small relative-timing assumption to overcome the problem of gate orphans associated with internal carry propagation. The relative-timing assumption is however independent of the RCA size. The primar...
متن کامل